The method of fictitious right-hand sides
نویسندگان
چکیده
منابع مشابه
Linear programming with interval right hand sides
In this paper, we study general linear programs in which right handsides are interval numbers. This model is relevant when uncertain and inaccurate factors make di–cult the assignment of a single value to each right handside. When objective function coe–cients are interval numbers in a linear program, it is used to determine optimal solutions according to classical criteria coming from decision...
متن کاملReducing Right-Hand Sides for Termination
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under mild conditions we prove that the transformed system is terminating if and only if the original one is terminating. Both transformations are very easy to implement, and make it much easier to prove termination of some...
متن کاملA Multigrid Method for the Solution of Linear Systems with Multiple Right-Hand Sides
In a wide number of applications in computational science and engineering the solution of linear systems of equations with several right-hand sides given at once is required. Direct methods based on Gaussian elimination are known to be popular in that setting. Nevertheless if the dimension of the problem is very large or if matrix-free algorithms are preferred, preconditioned block Krylov space...
متن کاملThe bilevel knapsack problem with stochastic right-hand sides
We introduce the bilevel knapsack problem with stochastic right-hand sides, and provide necessary and sufficient conditions for the existence of an optimal solution. When the leader’s decisions can take only integer values, we present an equivalent two-stage stochastic programming reformulation with binary recourse. We develop a branch-and-cut algorithm for solving this reformulation, and a bra...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1984
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1984.104108